A Dynamic Clause Specific Initial Weight Assignment for Solving Satisfiability Problems Using Local Search

For decades, the use of weights has proven its superior ability to improve dynamic local search weighting algorithms’ overall performance. This paper proposes a new mechanism where initial clause’s are dynamically allocated based on problem’s structure. The starts by examining each clause in terms size and extent link, proximity other clauses. Based our examination, we categorized clauses into four categories: (1) small linked with neighborhood, (2) large (3) (4) neighborhood. Then, according category. To examine efficacy weight assignment, conducted an extensive study technique many problems. concluded that allocation contributes significantly improving process’s performance quality. further investigate mechanism’s effect, compared state-of-the-art algorithms belonging same family using weights, it was clear outperformed algorithms. We also show could be generalized minor changes utilized within general-purpose stochastic